Medical device communication method

ABSTRACT

A medical device communication method that may be implemented within a variety of medical devices including but not limited to infusion pumps. The method may be implemented with a protocol stack for at least intra-device communication. Embodiments provide connection-oriented, connectionless-oriented, broadcast and multicast data exchange with priority handling of data, fragmentation, and reassembly of data, unique static and dynamic address assignment and hot swap capability for connected peripherals or subsystems.

INCORPORATION BY REFERENCE TO ANY PRIORITY APPLICATIONS

Any and all applications for which a foreign or domestic priority claimis identified in the Application Data Sheet as filed with the presentapplication are hereby incorporated by reference under 37 CFR 1.57.

BACKGROUND OF THE INVENTION Field of the Invention

One or more embodiments of the invention are related to the field ofmultiplex communication protocols for medical devices such as, but notlimited to, infusion pumps. More particularly, but not by way oflimitation, embodiments of the invention enable a medical devicecommunication method for communication between connected peripherals andsubsystems that includes connection-oriented, connectionless-oriented,broadcast and multicast data exchange with priority handling of data,fragmentation and reassembly of data, unique static and dynamic addressassignment and hot swap capabilities.

Description of the Related Art

Devices that exchange data generally do so using a communicationprotocol. Communication protocols enable data to be transmitted andreceived in a controlled manner. Medical devices are example devicesthat may utilize a communication protocol, for example to exchange databetween peripherals or subsystems that generate or utilize data. Thereare many types of communications protocols that vary in complexity,efficiency and hardware utilization. Current communication protocolsutilized within medical devices make use of the operating system andparticular bus architecture within the medical device. A problem withthis type of architecture is that some implementations may preventtime-multiplexed access of the communication link, thereby starving orotherwise preventing multiple applications from communicatingsimultaneously. In addition, applications that transfer data usingoperating system and bus specific software calls must be altered whenthe operating system or bus architecture changes, specifically toaccount for differences in operating system calls or with respect to thebus architecture, different data formatting, sequencing and any otherprotocol specific nuances. In addition, medical devices in general mustundergo extensive testing to ensure that they do not fail. Thus,changing bus architectures increases costs associated with applicationsthat make use of the bus architecture, since the application must beretested if the source code for the application is altered.

Known communications protocols are generally targeted at a specific typeof communication bus architecture, for example Ethernet, WiFi,Bluetooth, CAN, Serial, I2C, SPI, etc. Known communication protocols ingeneral are not capable of use with more than one type of communicationbus since they attempt to provide a solution to a specific communicationproblem in a coherent manner. Because of the low power requirements,limited processor capabilities and limited memory capacity of medicaldevices with embedded processors that do specific functions or tasks,such as infusion pumps, existing sophisticated communications protocolsare generally not utilized in such medical devices.

In summary, known solutions use communication protocols that are tied toa specific operating system and/or communications bus. Unfortunately,these communication protocols are not agnostic to all communication bustypes and do not provide an efficient and lightweight protocol stack forintra-device communication that includes connection-oriented,connectionless-oriented, broadcast and multicast data exchange withpriority handling of data, fragmentation, and reassembly of data, uniquestatic and dynamic address assignment for connected subsystems and hotswap capabilities. For at least the limitations described above there isa need for a medical device communication method that provides thesefeatures as described and claimed herein.

SUMMARY OF THE INVENTION

Embodiments of the invention enable a medical device communicationmethod for communication between medical peripherals and subsystems thatincludes connection-oriented, connectionless-oriented, broadcast andmulticast data exchange with priority handling of data, fragmentationand reassembly of data, unique static and dynamic address assignment andhot swap capabilities. Example medical devices that may employ anembodiment of the invention include but are not limited to infusionpumps, both present and future. Embodiments of the communicationprotocol provide an interface that is detached, or otherwise abstractedfrom the operating system and underlying bus architecture within themedical device, making the behavior and interface of communicationprotocol consistent across bus architectures and operating systems,which is unknown in the art of infusion pumps for example. Hence, thesame application may be utilized on multiple hardware platforms, forexample without altering the application itself. Thus, embodimentsenable simplified application code, portability thereof and minimizemaintenance and testing requirements. Embodiments may utilize any typeof physical communication path, for example wireless or hardwired,including but not limited to a data bus. Embodiments for intra-devicecommunications over a data bus generally employ data bus driversspecific to each type of data bus to control reading and writing of dataover the bus along with a standard interface to these data bus drivers.

Embodiments may be implemented in separate layers of software configuredto execute on one or more computing elements, wherein each layerperforms operations to provide data exchange that is generallyindependent of the other layers. Each layer for example may create, reador update headers associated with data to be exchanged, wherein theheaders contain information to support the above-mentioned features. Thelayers make up what is known as a protocol stack. Embodiments of theprotocol stack may include a manager layer, session layer, transportlayer, and data link layer or any other architecture as long as theresulting implementation provides the functionality described herein.

Depending on the peripheral or subsystem, data type, priority anddesired reliability of data to be exchanged, applications may transmitdata using connection-oriented data exchange to provide guaranteeddelivery of data or connectionless data exchange for less sensitivedata. Embodiments also support one-to-one, as well as one-to-many andmany-to-one multicast, and broadcast modes of data exchange betweenconnected peripherals and sub-systems. At least one embodiment alsosupports priority based data exchange and gives preference to highpriority data over low priority data to ensure that high prioritymessages are delivered first. Additionally, at least one embodimentsupports data fragmentation and reassembly data to comply with demandsof the particular physical communication technology. Embodiments alsoprovide unique static and dynamic address assignment for connectedsubsystems and hot swap capabilities, which are unknown for example incurrent infusion pumps.

Specifically, in the case of connection-oriented communication, at leastone embodiment utilizes a Communication ID or “CID”, as a token touniquely identify all active connections within a subsystem and routethe data between respective applications. In the case of connectionlesscommunications, at least one embodiment uses port numbers, for examplesource and destination port numbers, to identify the targetedapplication. At least one embodiment supports subscription services forrecipient applications, which enables multicasting of data to allsubscribed applications. Multicasting can be both connection-orientedand connectionless. In connection-oriented communication sessions, atleast one embodiment guarantees delivery of data, for example usingacknowledgements. Alternatively, connectionless communication sessionsdo not guarantee delivery of data, but are very efficient. At least oneembodiment supports broadcasting of data/messages, wherein the broadcastmessages are forwarded to all the subsystems connected to thebroadcasting subsystem.

Applications may need to exchange data larger in size than an underlyingcommunication technology or data bus can support. In such cases, atleast one embodiment breaks or fragments the data into a smaller size,for example that the data bus can actually transfer. At least oneembodiment reassembles data into the original data size at the receivingend. At least one embodiment executes on embedded systems that may havelimited resources, including memory, processing power, bus utilization,and power. Hence, embodiments efficiently utilize available resources.Example data exchanges that are large enough to warrant fragmentation ofmessages include drug library downloads and firmware updates.

With respect to fragmentation, at least one embodiment utilizes windowthat represents a count of fragments that may be sent before receivingan acknowledgement from receiver. In at least one embodiment, thetransmitter requests for window size from the receiver before sendingthe first fragment. The receiver determines the available memory spaceto accommodate received packets and responds with the window size, forexample as an integral multiple of the maximum frame size that fits intothe available memory. The transmitter numbers the fragments in sequenceand sends them to receiver. After a window size worth of messages havebeen sent, the transmitter waits for an acknowledgement of the lastfragment. The receiver accumulates all the received fragments andverifies that all the received fragments are in sequence. If there is nomissing fragment, the receiver sends the fragment number of lastfragment as an acknowledgement, or otherwise sends the fragment numbersof missing fragments as part of negative acknowledgement or NAK.

Since medical devices such as infusion pumps in the future may includehot swappable peripherals or subsystems, at least one embodimentsupports unique address assignments to connected devices in order toprovide conflict free exchange of data, thus reducing complexity inapplications. At least one embodiment supports communication overmultiple underlying data transfer technologies such as serial, CAN, SPI,SDIO, USB, or any other type of physical medium or data bus. At leastone embodiment also keeps track of devices connected on each bus androutes data onto the respective bus.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features and advantages of the inventionwill be more apparent from the following more particular descriptionthereof, presented in conjunction with the following drawings wherein:

FIG. 1 illustrates an architectural view of a system having a userinterface controller, and multiple peripherals that communicate with oneanother using an embodiment of the invention.

FIG. 2 illustrates a hierarchical layered embodiment of the inventionimplemented as a protocol stack.

FIG. 3 illustrates an embodiment of an address request methodimplemented within the manager layer.

FIG. 4 illustrates an embodiment of a simple infusion sequence utilizingvarious messages provided by embodiments of the method.

FIG. 5 illustrates an embodiment of a connection method implementedwithin the session layer.

FIG. 6 illustrates an embodiment of a data exchange method implementedwithin the session layer.

FIG. 7 illustrates an embodiment of a disconnection request methodimplemented within the session layer.

FIG. 8 illustrates a layer flow diagram that shows the flow of datawithin the various layers implemented in at least one embodiment of theinvention.

FIG. 9 illustrates an activity diagram showing routing between variousdevices.

FIGS. 10A-D illustrate the structure of the messages of the SessionLayer.

FIGS. 11A-B illustrate the structure of the messages of the TransportLayer.

FIGS. 12A-B illustrate the structure of the messages of the DataLink/Physical Layer.

FIGS. 13A-B illustrate an exemplary message transfer of a medicalfunction using exemplary values within the messages to demonstrate thesystem and method according to at least one embodiment of the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

A medical device communication method will now be described. In thefollowing exemplary description numerous specific details are set forthin order to provide a more thorough understanding of embodiments of theinvention. It will be apparent, however, to an artisan of ordinary skillthat the present invention may be practiced without incorporating allaspects of the specific details described herein. In other instances,specific features, quantities, or measurements well known to those ofordinary skill in the art have not been described in detail so as not toobscure the invention. Readers should note that although examples of theinvention are set forth herein, the claims, and the full scope of anyequivalents, are what define the metes and bounds of the invention.

FIG. 1 illustrates an architectural view of a system having userinterface controller or “UIC”, and multiple peripherals that communicatewith one another using an embodiment of the invention. As shown userinterface controller UIC communicates with peripherals Pump MotorControl or “PMC”, PMC 1 and PMC 2 as well as communication engine or“CE” for various applications including but not limited to drug library,status and diagnostic message handling. For exemplary purposes, UIC hasa destination/device ID, e.g., an address of 5 and messages from UIC tothe other devices travel over pathways uniquely defined by the tuplesdefined in the table, for example on a per device and communication IDdefined channel. These channels are shown in the table above UIC, namelybetween UIC and PMC 1, at ports 10 and 20, i.e., the therapeutic andstatus ports, via Communication ID or “CID” 100 and CID 250 respectivelyfollowed by a channel used between UIC and PMC 2 at port 10, thetherapeutic port, via Communication ID 100, along with a channel betweenUIC and CE at port 40, via Communication ID 175. The CE, whose addressis 7, shows channels in the table above CE to PMC 2 and the UIC, namelydevices 2 and 5 via Communication ID's 250 and 175 respectively. PMC 1is illustrated as having channels to the UIC, via Communication ID's 100and 250. PMC 2 is illustrated as having channels to the UIC and CEthrough ports 10 and 20, via Communication ID's 100 and 250. PMC 3 and 4may be hot swapped into the system or otherwise commanded or queried onthe fly. Embodiments of the invention are generally configured toutilize minimal memory and processing to enable execution on deviceshaving limited memory and limited processing power, which is generallyunknown in the art with respect to sophisticated communicationsprotocols for example. In one or more embodiments, the stack utilizesone kernel thread to execute the Data Link layer and Transport lowerlayer, whereas remaining layers are part of application process andexecute in the context of application. Minimum thread implementationsupports blocking access, for example read and write operations blockuntil the operation is completed. Embodiments may also supportasynchronous callbacks, and in such cases, the stack may utilize twothreads, one for write operations and one for read operation, hencetotal number of threads utilized is 2*N+1, where N is the number ofapplications using the stack.

FIG. 2 illustrates a hierarchical layered embodiment of the inventionimplemented as a protocol stack. As shown, a data message in theapplication layer is N bytes long. The application layer may include anyfunctionality independent of the protocol stack that is implemented inthe layers beneath the application layer as shown. When the message istransmitted from one application to another, for example to anapplication executing on a peripheral or subsystem, control informationor headers are appended to the message as the message descends layers.The various headers or other appended information are removed as themessage rises through the protocol stack to the respective receivingapplication.

In one or more embodiments, a manager layer may be utilized to implementthe first layer in the protocol stack beneath the application. Themanager layer may provide standard interfaces to applications across anydesired operating system. The layer provides application programmerinterfaces or API's that enables socket-based communications betweenapplications. The manager layer also manages file descriptors andfacilitates opening of ports. In at least one embodiment, the managerlayer creates and otherwise utilizes a message header having a portnumber and file descriptor.

A session layer is another layer in the protocol stack and provides orincludes API's to exchange data and control between manager layer andsession layer. The session layer may provide guaranteedapplication-to-application delivery of data and enablesconnection-oriented and connectionless-oriented modes of communication.This layer also enables one-to-one, one-to-many, many-to-one multicastand broadcasting mode of communication. The layer maintains thetranslation between CID and an associated socket or virtual port. Forconnection-oriented communication, the protocol utilizes the CID andotherwise generates and utilizes CID's. As the connection-oriented dataexchange utilizes a handshake between applications for data exchange,the session layer handles the handshake and generates a CID for thecommunication and informs the other participating session layers ofapplication(s) about the CID. After the handshake, data packets utilizethe CID for communication. In case of connectionless communication, noCID is utilized and hence both source and destination port addresses areexchanged in each communication packet or payload. In at least oneembodiment, the manager layer creates and otherwise utilizes a messageheader having control flags and a message type along with acommunication identifier. This structure along with an exemplaryconnection table is shown in FIG. 10A, along with exemplary messagetypes in FIGS. 10B-D. The control flags may be implemented with a layerflag of 1 bit, a connection type of 2 bits and a CID source of 1 bit forexample. The session layer utilizes some messages that are associatedwith the session-session communications and are never passed up thestack to the manager layer in one or more embodiments. These messagesare generally used for establishing or closing connections,acknowledgements, etc. If the layer flag is set, for example set to Trueor 1, the message will be consumed at session layer and will not beforwarded up the stack. The connection type flag indicates the type ofconnection, for example if connection-oriented, set to 01 or ifconnectionless, set to 00. An example connectionless protocol is UserDatagram Protocol or UDP while an example connection-oriented protocolis Transmission Control Protocol or TCP. The CID source bit is used toidentify if the data as being sent from the entity that generated CIDfor the connection in use or from sub-modules using this CID forcommunication. The entity that generates CID for communication sets thisbit for all the messages generated by it for the respective activeconnection, while other entities involved in communication reset thisflag for messages while using this CID. As the CID is unique within theentity generating CID, there may be duplicate CIDs across otherentities. Hence, this layer helps in resolving the source of CID (localor remote) via this flag. The message type field associates messageswith categories and lets the session layer know what to expect in thefollowing fields. The message type field is a 4-bit wide field in one ormore embodiments. The message type field is used to determine the typeof message. Exemplary values include 0000 for data, 0001 for connection,0010 for CID, 0011 for socket, 0100 for service and 0101 for deviceinformation. Any module that provides a service generates a unique CIDfor communicating with the consumers of the service. Communication ID‘0’ is reserved for connectionless type of communication in one or moreembodiments. Communication ID field is 1 byte wide and is utilized forthe data that is passed up the protocol stack. CID can hold any numberbetween 0-255. As state above, CID ‘0’ is for connectionless typecommunication and is thus not a valid ID for connection-orientedcommunication. Connection oriented type communications will have a CIDin the range of 1-255. Hence, CID ‘0’ is an implicit indication ofconnectionless communication, any other number between 1-255 suggestsconnection-oriented. Applications may establish one or more notificationfilters to select message to receive and process using a desiredfunction. The filtration mechanism may utilize one or more regularexpression that specifies the location, length and content of thematching data in the data portion of the packet. This functionality isimplemented in the management layer in one embodiment of the invention.Before the management layer forwards the data to application, it maycheck if any filters are defined on the data. Depending on the filter,the manager layer filters data and forwards the data to respectivecallback handlers.

Embodiments of the invention enable a single application to maintainconnections with more than one device over one or more physicalcommunication layers or bus implementations. This is accomplished by theuse of virtual ports. A single application such as the TherapeuticManager in the UIC may for example maintain open connections with morethan one drug pump PMC or other device as would be asserted during amulti-channel infusion. Similarly, many applications may maintain aconnection with one application or device, for example, UIC, CE, andother applications may connect to a particular PMC to gather infusionstatus information.

The one-to-many and/or many-to-one communication relationship canfurther be classified into three types, unicast, multicast andbroadcast. For example, different applications can gather infusionstatus from a PMC either by requesting, for example via multicasting, orthe PMC can broadcast its status on a known port and interestedapplications can listen to the port. Listening to a known port can beeither anonymous or subscription based. In anonymous mode, broadcastingapplication continuously transmits on a known port and any applicationcan listen to the port. In subscription based mode, the broadcastingapplication will not transmit until there is at least one recipient,interested application, which will have to request for service anddisconnect when done using the service.

Virtual ports can be implemented by enabling a handshake betweenparticipating modules/applications. Applications providing the servicegenerally open a port and connect to the port. For every acceptedconnection request, CID is generated by the service provider and ispassed back to requesting entity in an acknowledgement. Subsequentcommunication is performed using this CID. In general, the CID is uniqueto the entity that generated it. A disconnection message is used to stopcommunication and the CID is then returned to the pool, for example tobe reused later. If the service provider runs out of CIDs, it may returna NAK to incoming connection requests with appropriate NAK ID. In caseof communication failure, for example module shut down, too much waitingtime, too many retries, etc., after waiting for sufficient retries tosend a message, one or more embodiments may assume that thecommunication has stopped and CID is then returned to pool. As the CIDare generated by the service provider and are unique within the entity,there can be duplicate CIDs on other sub-entities. To avoid the conflictbecause of duplicate CIDs, two CID tables may be maintained, one for theCID generated by the system, and the other for the CIDs generated byother systems engaged in communication. The creator of CID sets the “CIDSource” flag, hence when other involved applications look at this flag,they perform lookup in appropriate CID table. Each entity may thereformaintain a table shared by the applications running on it. This table ismaintained at the session layer and serves as a reference table forrouting incoming data packets to respective ports/sockets.

As example scenario is illustrated in the following table, and is alsoshown in the bottom portion of FIG. 10A for illustration purposes and isnot intended to limit the invention as claimed. As shown, the connectiontype may be set to a value indicative of a connection-oriented type ofcommunication, such as TCP as shown, or a connectionless communicationtype, such as UDP as shown, or a “Service”, for example an applicationthat exists to log data for other applications. The destination address,destination port and communication ID generally uniquely identify a rowin above-mentioned table. Destination address is the logical address ofa device engaged in a communication. Embodiments may support repeatedentries with the same destination address, which indicates multipleactive connections with the same destination device. The source portfield stores the local port number responsible for handlingcommunication(s) with the CID associated therewith. Depending on CID,received messages are routed to the respective port. Multiple repeatedentries in the source port column suggest various applicationscommunicating over same port, which may be indicative of one-to-manycommunication for example. In one or more embodiments, applications mayregister or otherwise provide a request to a service provider to receivemessages. The destination port is the port number on the destinationdevice engaged in a communication. The communication between adestination port and the local port associated therewith takes placeover the respective CID. Hence, CID behaves as a key for thiscommunication. Since the CID is a unique number assigned to distinctcommunication requests, and which may be implemented with a particulardata type of a certain size, there may be an upper limit to the numberof active connections that can be handled by the system/application. Theupper limit is thus an upper numerical limit of the CID. Once the countof unique CID's exceeds the upper limit, one or more embodiments send aNAK to new incoming connection requests. The File Descriptor (FD)functions similar to file handler or file descriptor in standardoperating systems as one skilled in the art will recognize.Communication related operations are performed using this descriptor.Repeating entries of FD suggests multiple connections are being servedby one application, many-to-one type of communication. See also FIGS.10B-D for specific message structures utilized in one or moreembodiments of the invention.

Connection Destination Destination Source File Type Address Port PortCID Descriptor Service 8 50 40 100 55 TCP 5 23 60 72 63 Service 15 68 40110 87 UDP 4 20 55 103 21

The transport layer is another layer in the protocol stack and isresponsible for transport layer to transport layer delivery of data.This layer handles flow control, timeouts, acknowledgements andfragmentation and reassembly of data and also resolves the datapriority. At least one embodiment of the protocol stack supports two ormore priority levels, for example three priority levels, High priority,Medium priority and Low priority and depending on the priority of data,the transport layer puts the data in a respective priority queue. Thetransport layer may be implemented with two sub-layers namely thetransport upper and lower layers. The transport upper layer along withmanager and session layers resides in application space, whereas thetransport lower layer along with data link layer resides in kernelspace. The transport upper layer handles reading and writing to priorityqueues, fragmentation and reassembly of data and transport-to-transportlayer acknowledgements, whereas the transport lower layer may beimplemented as a very thin layer and handles reading from priorityqueues and communication with one or more other stack layers, forexample a lower stack layer. This structure along with an exemplarymessage types in FIGS. 11A-B.

The transport layer generally ensures that manageable sized datagramsare sent over the underlying bus. Hence, this layer looks at the datacoming from upper layers and if the size of data exceeds MaximumTransmission Unit (MTU) size, the layer fragments the incoming data tofit within MTU boundary. Thus, embodiments of the invention may utilizeany type of bus of any size, e.g., one bit as per a serial bus, ormultiple bits as per a parallel bus of any width. The layer addsappropriate information to the data so that it can be reassembledfaithfully at the receiving end. If the incoming data can be sent inthree fragments, ‘Fragment ID’ field is used to number the fragmentsstarting from ‘1’ and the ‘Extended flag’ bit is not used. All zeros inthe ‘Fragment ID’ field indicates an un-fragmented message and hence istreated as a standalone message. If a message requires more than threefragments to be transmitted, ‘Extended Flag’ is set, which enables anextra of 8 bits (Extended Fragment ID field is 8 bits) to be used fornumbering the fragments. With this flag set, there are total of 10 bitsavailable for numbering which can support 1023 (2{circumflex over( )}10-1) fragments. At the receiving end, ‘Extended flag’ is inspectedto determine if ‘Extended Fragment ID’ is used or not. If the flag isset, the receiver assumes the fragments to arrive in sequence, startingfrom sequence number 1. But, if the flag is not set, the receiverinspects the ‘Fragment ID’ field. If the ‘Fragment ID’ field has zero init, it indicates an independent message, but if it's a non-zero value,the receiver treats the received message as fragmented data (expects amaximum of three packets). Once all of the fragments are received, thereceiver will re-assemble all the fragments into one message. To dothis, the receiver aligns all the received messages in ascending orderof their fragment ID. Then the receiver verifies that no fragment hasbeen missed in the sequence. If all fragments are received successfully,the receiver removes the ‘Transport layer’ header information from allthe related fragments and concatenates them into one message. IfTransport layer has limited memory to re-assemble all the fragments, itforwards the fragments up the stack, as they arrive, which getsreassembled in application buffer.

Congestion control is also provided by the transport layer, which mayimplement messages dedicated specifically for transport layer to layercommunication. These specific messages are consumed at transport layerand not passed up the stack. One such message is the window message,which is exchanged to determine window size for data exchange.

Before sending the first fragment from fragmented data, the transmitterrequests a window size from receiver. The receiver looks at theavailable buffer space in the application buffer and computes the numberof fragments it can stage before running out of available memory. Itresponds to transmitters request with this computed number as windowsize. Then the transmitter sends window size worth of fragments beforeexpecting an acknowledgement. Once the receiver receives all themessages transmitted in a window, it verifies that all the fragments arein desired sequence and sends acknowledgement for last received fragmentin the sequence. If the receiver determines that fragment(s) is missing,it sends an NAK for the missing fragment and the transmitterre-transmits the respective fragment(s). The transmitter may check forwindow size in middle of communication to keep the data exchangeoptimized, also, if the receiver gets low on resources, it canexplicitly send a window response and update the transmitter about thewindow size.

The transport layer is also responsible for the reliable delivery ofdata. The transport layer has ability to ensure delivery of data to thereceiving end. Transport layer has a field for acknowledgement. Thereceiver may send an acknowledgement for every received data packet withthe acknowledgement flag set. In case of fragmented messages, anacknowledgement is sent when the last fragment in a window has beenreceived or last frame in the message has been received or timer expiresbefore all messages have been received.

Embodiments of the transport layer may also implement a “time to live”.For example, after transmitting a message, the transmitter initiates atimer and waits for an acknowledgement. If acknowledgement is received,the timer is reset and next packets are transmitted. But if noacknowledgement is received, the transport layer re-transmits themessage and again waits for an acknowledgement. The transmitter willretry to send the message certain number of times and if it fails to getan acknowledgement, it will assume that the receiver is not availableand will inform upper layers. In case of fragmentation, the transmittersends window-sized messages and then waits for an acknowledgement on thelast fragment sent. If the timer expires, the transmitter will resendthe messages again.

The transport layer also may implement fault detection and recovery. Forexample, the transport layer at the receiver may request the transmitterto re-transmit selected frames through layer-to-layer messages.

The transport layer may also implement priority for messages. Forexample, the upper layers may pass the message priority down to thislayer and this layer adds the priority to the message header. Header hasa two bit fields for message priority and hence there are four prioritylevels possible in one or more embodiments although any number of bitsmay be used for priority to implement more levels and this applies toall message partitions and bit numbers described herein. Each prioritylevel has its own queue and depending on message priority, transportlayer puts them into respective queues to be processed by other layers.As there are four priority levels in a 2-bit embodiment, there may be amaximum of four priority queues and a minimum of one queue, but thenumber of priority queue depends on the number of priority levels used.

The data link layer is another layer, by way of example and notlimitation the bottommost layer, in the communication stack and isresponsible for subsystem-to-subsystem delivery of data. This layercompletely resides in the kernel space. Data link layer may also beimplemented with two sub-layers, for example a Link Layer and MediaAccess (MAC) layer. The link layer verifies data integrity bycalculating/verifying CRC for each outgoing/incoming data frame and alsohandles any hardware acknowledgements for example. The layer alsohandles requests for unique logical addresses as well and generates andassigns unique addresses. The MAC layer utilizes driver(s) handling theunderlying physical communication channels or bus(es). As the dataframes arrive on the buses, the MAC layer copies the received data intoa memory pool and passes the pointer to the copied data to Link layer.At least one embodiment supports communication over multiple underlyingdata transfer technologies or hardware implementations such as serial,CAN, SPI, SDIO, USB, or any other type of communications medium or databus. This structure along with an exemplary message types in FIGS.12A-B.

In one or more embodiments, the data link layer is responsible for dataintegrity, for example through the use of CRC checking or any other typedata integrity coding or format desired. Embodiments of the data linklayer are also responsible for logical address assignment. For example,this layer is responsible for assigning and managing logical addressesof modules in a device. All the modules like Pump Motor Controller,Power Supply Controller, Communication Engine, User InterfaceController, etc., have a unique ID so that they can be uniquelyidentified in a pump. The protocol stack can support 254 modules as theaddress field is 1 Byte field and logical addresses 00, 01, and FF arereserved addresses. If modules are identified according to their uniquehardware address (MAC addresses), and as the hardware addresses are morethan a Byte in size, this would add overhead to the protocol. To avoidthis, each module may be assigned a logical address between 1 to 255 andthis layer then maintains the assigned addresses. The application layerdoes not need to know what the hardware address is or what the logicaladdress is in general, which simplifies logical and API calls.

One of the modules is generally assigned with the task of generatingunique logical addresses for other modules in the device, no matter ifthose modules are connected directly to this special module or not. Whenthe device powers on, all the modules power on as programmed. The moduleresponsible for generating address for devices is called the “root”device. The root device is aware of its special role and assigns itselfa logical address of 01. As other modules wake up, they assume theirlogical address as 00. They know that 00 is not a valid address but alsoknow that there exists a module with address 01 who can provide a uniqueaddress to them.

Hence, these modules send address requests to a destination with address01. On receipt of this message, the root module checks its internaltable to verify if the requesting hardware already has a logical addressassigned. If a logical address is assigned, the root module sends thatsame logical address in response; else it generates a unique logicaladdress, updates this address in its internal table against therequester's MAC address and sends this address in response. On receiptof an Address Response, the requester module starts communicating withthis logical address.

A module in one or more embodiments may not communicate without a validlogical address. If multiple modules try to request for a logicaladdress, there will be collisions. Due to collisions, no requests everreach the root module, and thus none of the modules receives a logicaladdress. In this scenario, other modules will retry after a randomperiod of time. Depending on the criticality of device, the amount ofrandom time can be varied, i.e. critical devices may wait for lesserperiod of time before a retry. The amount of wait time may be part ofconfiguration and the devices may wait with reference to their internalclock for example.

If a device does not desire to use the dynamic addressing mechanism,each module may be programmed with a unique address, for example toimplement a static versus dynamic address assignment scheme. Embodimentsmay still utilize a root module that maintains the addresses of theconnected modules.

Embodiments of the data link layer may also implement routing. Asmentioned, a module may have multiple bus types or topologies and theremay be different type of devices connected on various buses. If a DataLink layer receives a packet that is not addressed to it, it firstchecks if it has multiple bus architectures and if true, it forwards themessage to other buses; else it simply discards the packet. This kind ofaddressing mechanism is well suited for star topology for example. Henceif PMC1 wants to send data to PMC2 but there is no direct data path,then it will re-route it through the root module. In this case, the rootmodule can broadcast the message in the network or perform a lookup inits internal table and just forward the packet on a specific line.Hence, in one or more embodiments that implement routing, each modulethat supports multiple communication buses may maintain a list of alldevices directly connected to the module so that they can efficientlyroute the packets. As stack supports data routing, it seamlessly bridgesmultiple heterogeneous data buses, thus making communication, bustopology independent. Few examples of possible bus topologies includeRing, Star, Mesh, and Tree topologies or any other topology that may beutilized to transfer data.

FIG. 3 illustrates an embodiment of an address request methodimplemented within the manager layer. As shown, when a device is addedto the system, for example hot-swapped in, the device boots and requestsan address from the root device. The new device waits for a response andif a timeout occurs, requests an address again. Once the root devicereceives the address request message, it looks up an available devicenumber and generates a logical address for the new device and updatesthe table. Alternatively, if there are no available numbers left a NAKwith appropriate error message may be returned to the new device. Theroot device returns the new device logical address to the new device inan address response message. Any further requests for the address arehandled by lookup via the root device. The new device stores the logicaladdress in a local table for further use. This capability generally doesnot exist in medical devices or infusion pumps since the configurationsare generally assumed to be fixed, using a fixed operating system andfixed bus without regard to potential new devices and new types ofdevices that may communicate with a root device.

FIG. 4 illustrates an embodiment of a simple infusion sequence utilizingvarious messages provided by embodiments of the method. Once the addressof a new device is obtained, it may communicate with the othercomponents within the system. The figure shows user interface controllerUIC having device number 1, initially connecting to a drug infusion pumphaving device number 3, wherein the logical addresses of the devices, ordevice numbers are obtained as shown in FIG. 3. The UIC accepts inputfrom a Care Giver that indicates an infusion is to take place. The UICapplication calculates the necessary steps to achieve the infusion andsends an infusion header and data message to the drug infusion pump,which acknowledges the message. The UIC then sends an infusion safetydata message, which is acknowledged and after the infusion is complete,the UIC sends an infusion stop data message, which is acknowledged. Thisscenario is a typical scenario that enables any type of drug infusionpump to be added to a system and utilized, for example in a hot swapscenario where an infusion pump may return an error or a different typeof drug infusion pump is to be added to the system and utilized forexample.

FIG. 5 illustrates an embodiment of a connection method implementedwithin the session layer. In the scenario shown, the UIC requests aconnection in order to communicate with the PMC to command the PMCand/or for example obtain status updates. In this case, PMC acts as aservice provider as the PMC is providing status updates on a known port.UIC sends a connection request to PMC on that port, e.g., port 10, shownas a message passing from left to right. After receipt of the connectionrequest, the PMC accepts the request, generates a unique CID, e.g., 26for this communication and updates its internal table. The PMC sends thegenerated CID back to UIC as a part of connection accept message, showntraveling from right to left. On receipt of connection accept messagefrom the PMC, the UIC extracts the CID from the message and updates itsinternal CID table as shown in the lower left. The UIC then sends anacknowledgement message to the PMC to confirm the successful receipt ofCID. If the PMC is not able to process the request from UIC and hencecannot establish communication, the PMC sends a connection rejectmessage to the UIC. On receipt of connection reject message, the UIC mayretry to obtain a connection. See also FIGS. 10A-D, 11A-B and 12A-B foran embodiment of the exemplary message structures that may be utilizedto form an implementation of various layers, which are described furtherin detail below.

FIG. 6 illustrates an embodiment of a data exchange method implementedwithin the session layer. Once the PMC receives acknowledgement from theUIC, the connection process is complete. At this time, both devices mayexchange data using the agreed CID. When the session layer of PMCreceives any data from the UIC with a valid CID, it performs a lookup inits internal table against the ‘Destination ID’ and ‘CID’ to resolve theport number where the packet is to be forwarded.

FIG. 7 illustrates an embodiment of a disconnection request methodimplemented within the session layer. On completion of datatransmission, either of the communicating parties may request for aconnection termination. As shown, the UIC initiates the process ofconnection termination. It sends a disconnect request to PMC with therespective CID. The PMC processes the request and if there is no activecommunication, the PMC will send an acknowledgement to the UIC anddelete the CID entry from its table. On receipt of disconnectionacknowledgement from PMC, the UIC also removes the CID entries from itstable.

Although the general session layer communication protocol has beendescribed above, a more in-depth description of the Session layermessages follows, according to one or more embodiments of the invention.The message structures utilized in one or more embodiments of theinvention as described below are shown in FIGS. 10B-D.

Connection Request Message

For a connection-oriented communication session, when an applicationopens a socket to communicate over a port on some other device, ahandshake is performed before the communication starts. The handshakebegins with a connection request type message to the service provider.The “layer flag” is set for this message type. Therefore, the requestpacket is consumed by the session layer. The connection type may beinitially set to “Unknown” suggesting that the data packet is neitherconnection-oriented nor connectionless. The message type is set to“Connection” as the command is used to establish new connection. Themessage is a request for establishing new connection; hence “Command”field has “Connection Request” set. The application requesting aconnection specifies the destination's port address and also providesits own port address, hence the connection request packet has source anddestination port address.

Connect Accept Message

On receipt of a connection request message, if the service provider hasenough resource, it responds with a connection accept type of message.The service provider generates a CID for the communication and sends itto the requester as a part of this message. As the connection requestingentity has no information of the generated CID, the service providersends source and destination port address as a part of this message tolet the other end know about the generated CID.

Connection Acknowledgement Message

On receipt of a connection accept message, the requesting end updatesits internal table with the received CID. In response to connectionaccept message, the requesting end sends an acknowledgement message toindicate the service provider about the receipt of CID and complete thehandshake. It is possible that multiple applications on one modulerequest to communicate with one application on another module on thesame port number, e.g., many-to-one. To inform the service providerabout the particular application that is sending an acknowledgement,“source port” is added to the acknowledgement message.

Connection Disconnect Message

Once the communication is completed, any one of the participatingentities may request a connection disconnect for a graceful terminationof the connection.

Connection Disconnect Acknowledgement Message

This message is sent as an acknowledgement on receipt of a disconnectmessage. The message is intended to ensure that a communication is notterminated if an active connection still exists. If a disconnectionacknowledgement is not received within a certain time period, adisconnection attempt may be made again.

Connection Reject Message

If the service provider cannot accept any new connections, it sends aconnection reject in response to a connection request message. In theconnection reject message, it sends the reason for rejecting therequest. On receipt of a connection reject message, the requester mayretry after some time for example.

CID Info Request Message

Any participant involved in communication can request for status of CID.This message acts as a ping message to verify if the destination port isopen and CID is an active CID.

CID Info Response Message

On receipt of a CID Info request, a CID Info Response is transmitted.This message contains the source and destination port addresses involvedin communication, window size for transmission, etc., and also indicatesif the CID is active or not.

Socket Status Request Message

This message is utilized to request socket related information such asthe type of socket, purpose of opening this socket, etc.

Socket Status Response Message

This message is sent in response to Socket Status Request message. Themessage contains socket related information such as the type of socket,purpose of opening this socket etc.

Subscribe to Service Message

The communication protocol enables applications to provide a service,e.g. a broadcast service. For example, the PMC may have a servicerunning that broadcasts PMC status periodically on a known port. If theUIC requests the PMC status, it may simply subscribe to this servicewith the PMC and receive the messages. Typically these services areone-way communication.

Subscribe to Service Acknowledgement Message

Once the service provider receives a subscription request, it has toprovide a CID to the requester. The CID is delivered through anacknowledgement message.

Unsubscribe from Service Message

If a subscribed application no longer desires to be subscribed to aservice, it may request to unsubscribe. On receipt of an unsubscribeservice message, the service provider removes the entries from itsinternal CID table and sends an acknowledgement to the requester. If theservice provider finds that there is no one subscribed to a service, itmay decide to stop the broadcast service until it has at least onesubscribed application.

Unsubscribe from Service Acknowledgement Message

On receipt of this message the application requesting to unsubscribe,removes entries of CID from its internal table and releases the involvedsockets and ports.

Device Address Request Message

An application may request a logical address for a device using thismessage.

Device Address Response Message

On receipt of an “Address Request” message, a device sends its addressas a part of the response message. Alternatively, a Device AddressResponse Message may be sent independently at anytime and may notnecessarily be tied to a request message.

Device Type Request Message

This message is used to request name of a device. Every connected devicehas a unique address but may have non-unique names or no names. Devicetypes can be PMC, CE, UIC, etc.

Device Type Response

This message is generally sent in response to “Device Type Request”message and contains the type of the device sending this message.Alternatively, a Device Type Response Message may be sent independentlyat anytime and may not necessarily be tied to a request message.

Connection-Oriented Data Message

At least one embodiment of the session layer adds just two bytes ofheader information when sending data between devices. The CID isgenerated and exchanged during the handshake process prior to datatransfer.

Connectionless Data Message

Connectionless data transfer is used when no handshake is required totransfer data. As there is no handshake, there is no CID generated forthe communication and hence both source and destination port numbers areutilized to ensure the delivery of data.

FIGS. 11A-B and 12A-B illustrate corresponding message structures forexemplary embodiments of the Transport layer and Data Link layerrespectively and are described further below.

FIG. 8 illustrates a layer flow diagram that shows the flow of datawithin the various layers implemented in at least one embodiment of theinvention. Specifically, data flow up the protocol stack for incomingdata is shown. The destination application buffer location is not knownuntil the data frame moves up to manager layer. Hence, the fragment isstored in a memory pool until it reaches manager layer and once thetarget application is resolved, the data is copied from the memory poolinto application buffer. In one or more embodiments, memory utilizationmay be minimized by returning a buffer to memory if the buffer is over apredefined age threshold.

Data Link Layer

Data Link layer controls one or more physical communications links, databuses. The layer filters the messages directed to the specific deviceand ignores other messages. The layer may compute a CRC on the receivedpacket and verify it with the received CRC. Valid data frames are copiedinto a memory pool and pointer to these messages are forwarded to thetransport layer.

The transport lower layer and data link layer run as an independentservice and stores data in the designated priority queue, P1, P2, P3 orP4. The transport upper layer, session and manager layers execute in theapplication space, and the transport upper layer maintains pointers tothe priority queues and Communication ID tables. In one or moreembodiments, the memory pool, priority queues and CID tables are inshared memory space.

In one or more embodiments, the data link layer is further divided intotwo sub-layers, a link layer and a MAC layer. The MAC layer mayinterface with bus drivers and has a buffer for each underlying bus. Asthe data arrives on these buses, the data is copied into these buffersand then forwarded to link layer. The buffer may be implemented as apair of buffers, while one buffer is used for receiving new data, otherbuffer is used to transfer previously received data.

The link layer copies the data from buffers into the memory pool. Thememory pool is a contiguous memory block and each memory block may beimplemented as a factor of frame length. As the application consumesdata, the data is removed from the memory pool to make room for new datapackets. As the application consumes data randomly, there may be memoryholes in the memory pool. Hence, the link layer generally maintains alist of available memory locations in the memory pool. When memory isfreed from the memory pool, the pointer to available location is addedat the end of this list. When a new packet arrives, it is placed at thememory pointed by the first element in this list. If there is no elementin the list, memory pool will be considered full and the packets will bedropped. In one or more embodiments of the invention a memory managermay be utilized to control access to memory from the various layers,including concurrent access control of memory from the various layers.Embodiments of the invention may minimize or altogether avoid multiplecopying operations by maintaining one copy of data in the memory poolwhile passing pointers to the memory as the data moves up and down thestack. By controlling access to the memory during access, semaphores maybe utilized to ensure data integrity while allowing multiple processesto effectively utilize the data in a concurrent manner. Avoidingmultiple copy operations enables minimal memory utilization in embeddedenvironments and minimizes processor utilization as well.

As the transmitter has tendencies to push data on buses, they can soonover-utilize the bus by transmitting too much data. The bus driver atthe MAC layer in one or more embodiments may be implemented to handlesuch scenarios.

Transport Layer

In one or more embodiments, the transport layer may be divided into twosub-layers, a transport upper and a transport lower layer. The transportupper layer resides in application space whereas the transport lowerlayer resides in kernel space. These two layers together handletransport layer functionalities.

The transport layer is implemented in one or more embodiments toreassemble fragmented data and also to resolve data priority. When a newdata packet is received by transport lower layer, a timer may be startedfor the data. If the data is not consumed before the timer expires, thedata may be discarded and the memory freed from the memory pool. Thisavoids memory starvation if no application exists to consume receiveddata. If the acknowledgement field was set, the transport layer sends aNAK, “timed out in priority queue” error code, for example.

The transport layer header has an acknowledgement flag and if the flagis set, the receiving transport layer will have to send some kind ofacknowledgement for the received data fragment. If fragmented data isreceived, the acknowledgement is sent after receiving window size amountof data or a complete message. This flag is set for aconnection-oriented data transfer to ensure delivery of data. This flagmay also be set in a connectionless data transfer only if datafragmentation is utilized.

Fragmented Data Packet Handling

In case of fragmented data, before the transmitter starts sending anydata fragments, the transport upper layer at the transmitter firstrequests a window size from the receiver. The window size may beexchanged once during first data transfer or may be obtained beforeevery data transfer. Window size is the number of data fragments thatcan be sent before an acknowledgement can be expected. When receiverreceives a window size request, transport upper layer at receivers end,computes the amount of free memory in application buffer and sends theresponse as window size in the ‘window size response’ message.

In one or more embodiments, the transport upper layer at the transmitterside initializes a data structure for the CID that requested a windowsize. In this structure, the transport layer stores the CID, lastreported window size, last successfully received fragment number and themaximum allowed time period between two fragments, etc. Also, thetransport upper layer at the receiver maintains same structure. Thetransport layer expects that the fragments will be sequentially numberedstarting from 1 in one or more embodiments.

As the transmitter receives a window message, it calculates the numberof fragments to be transmitted before expecting an acknowledgement. Thetransmitter starts sending data fragments in sequence starting fromfragment number 1 for example.

When the receiver receives first fragment, the transport lower layerstarts a timer on the received data frame and places the fragment itinto the respective priority queue. The transport upper layer updatesthe structure and stores the sequence number of the fragment. If thefragment is delivered to the application buffer by upper layers, theupper layers inform the transport upper layer about the success. Thetransport upper layer updates its structure with the first fragmentbeing delivered. Upper layers do not inform application about theavailable fragment until all the fragments constituting to a message arereceived. An application buffer is used for re-assembly of fragments tominimize memory footprint.

If the transport upper layer receives all the fragments for a windowsuccessfully, it waits for all the fragments to be delivered toapplication buffer successfully. Once all the fragments are sent toapplication buffer, the received fragment number and delivered fragmentnumber match and the transport upper layer sends an acknowledgement forthe last fragment in the sequence. The transmitter receives theacknowledgement at the transport upper layer.

Ideally, the transport layer accumulates all fragments, verifies thatthey are in sequence and merges them into one complete message beforesending it up the stack. However, in one or more embodiments, thetransport upper layer forwards the frames to the session layer as theyare received, but ensures that the fragments are delivered in sequence.This optional implementation may be utilized to lower memoryutilization. This is the case since the message does not have to bereconstructed in full within the stack until the full message isreceived in the application. As the fragment number in the transportheader is 10 bits wide in one or more embodiments, the layer can supporta maximum of 1023 fragments (fragment number 0 is reserved andrepresents a non fragment data frame) before the fragment numberingoverflow. As each fragment has a maximum of 248 Bytes payload, hence atotal of 253,704 Bytes is required at the receiver end for each activeconnection to accommodate all the fragments. Any other size of fragmentnumber field may be utilized to increase the overall size as one skilledin the art will recognize.

At the receiver, as the fragments are received, transport upper layerupdates the last fragment number in its structure. Before updating, itverifies that the received fragment is in sequence with previouslyreceived fragment. If it detects a missing fragment, the layer stillforwards the fragments up the stack, but in their respective token putsan offset value. Metadata along with a pointer to the received datafragment is called a token. This offset value is used by manager layerto provide a gap while accommodating other fragments around the missingone, so that the gap can be filled once the missing fragment isreceived. For example to create an empty space in memory so that whenthe missing frame is finally received, it will be accommodated in thisempty space to complete the final message. Meanwhile, transport upperlayer waits for the fragments to arrive and then looks for any missingfragment in the sequence. Once the layer generates a list of all missingfragments, it requests for retransmission of fragments from thetransmitter. Once the missing fragments are received, they are forwardedto upper layers so that they can be used for filling the empty spaces infinal message.

When retransmission is required, transport upper layer at receiver end,sends retransmission request message with the desired fragment number init. The receiving end maintains a list of missing fragments and as themissing fragments are received, their entry is removed from this list.

If the transmitter retransmits an already transmitted fragment, thereceiver compares the fragment number with last received fragment numberand will detect that there has been a retransmission. The layer checksif the retransmission was requested by the receiver explicitly or not.If the retransmission was intentional, the fragment is consumed else thefragment is dropped assuming a false retransmission of data.

Once the transmitter sends one window size worth of fragments, it startsa timer and waits for an acknowledgement on the last fragment in thesequence. The transmitter may send any further fragments only when itreceives an acknowledgement. If the acknowledgement is delayed and thetimer expires, the transmitter may send a “window size” request messagebefore retransmitting the fragments. A receiver may fail to send anacknowledgement if the receiver is too busy or its buffers are full.Hence, a “window size” message is sent because it serves two purposes,the first being that a response to this message implies that thereceiver is ready for accepting messages, and the second being that thenew responded window size buffer is available at receiver so thatchances of getting an acknowledgement increases.

In case of missing fragments, the receiver sends a retransmissionrequest instead of an acknowledgement. A retransmission request can onlybe sent if the last fragment in the sequence was either receivedsuccessfully or was found missing. Hence, the transmitter considers aretransmission request message as an implied acknowledgement and no morewaits for an explicit acknowledgement, but may wait on acknowledgementfor retransmitted fragment.

Missing fragments can be of three types, the first fragment missing, anyfragment(s) missing between first and the last fragment of a completemessage, and the last fragment itself missing. If the first fragment ismissing and the receiver starts receiving from fragment number 2, itaccumulates all the messages till it receives window size messages andexplicitly requests for the 1st fragment. The same technique is used forrequesting any missing fragment between 1st and last fragment.

Missing the last fragment of a complete message may be a complicatedscenario because transmitter never informs the receiver about totalnumber of fragments needed to send a message and hence, there is no wayfor receiver to know when the message completes. Missing “last”fragments can be of two types, missing the last fragment from a windowand missing the last fragment of a message. In the case of missing thelast fragment from a window, it is easy to detect. Every time a fragmentis received, the receiver starts a timer and waits for next fragment tobe receive before the timer expires. The transmitter sends the lastmessage for the window and waits for an acknowledgement. If this messageis lost, the receiver waits for this last fragment to arrive. The timerat the receiver expires earlier than the timer at the transmitter. Asthe receiver keeps track of fragment sequences and window size, itrealizes that the last fragment was not received on time and hence sendsa retransmission request for the last fragment.

A more difficult problem occurs when the last fragment of a message islost. As the receiver has no idea about how many fragments willconstitute a message, it looks for the fragment with ‘last fragment’flag set. This fragment indicates the receiver that it was the lastfragment from the message. If this fragment is lost, the receiver has noidea when to stop reassembling fragments. To ensure delivery of thislast fragment, the transmitter can use following two approaches.

In the first approach, the transmitter knows that the last fragment isapproaching. It explicitly reduces the window size to make sure that thelast fragment of the message becomes the last fragment of the window aswell. As the receiver can detect the last fragment from a window, if thelast fragment from a message is lost, the receiver may requestretransmission.

In the second approach, the transmitter will send the last fragment with‘last fragment’ flag set, followed by few fragments with random payloadbut with incremental fragment number. If the last fragment of themessage is missing, the receiver will detect the missing fragment asthere will be gap in sequence numbers and will request forretransmission. When the receiver attempts to arrange the fragments insequence, it detects the fragment with ‘last fragment’ flag set andhence discards all fragments following this fragment.

Non-Fragmented Data Packet Handling

For a non-fragmented data frame, it is first received by transport lowerlayer, which starts a lifetime timer on this frame and puts the frame inappropriate priority queue. The frame is picked from the priority queueby transport upper layer, which forwards it to other layers, for exampleSession layer.

Session Layer

Session layer major responsibilities are to ensureapplication-to-application delivery of data and generate unique CID'swithin a system. The stack works on the principle of service providerand service consumer. The application providing service generates uniqueCID's for the engaged participants. The CID is unique within the systemrunning the service provider application in one or more embodiments. TheCID may be thought of as a key used to hide the information about sourceand destination ports engaged in communication.

The session layer may be implemented in a lightweight or a very thinlayer to a connectionless communication because a connectionless datapacket will contain the source and destination port addresses as part oftheir headers and hence does not utilize a CID.

Packets reaching the session layer may be divided into two categories,namely data and control. Further, the incoming data can beconnection-oriented or connectionless and fragmented or non-fragmented.

Connection-Oriented Data Transfer

Connection-oriented data transfer makes use of a connection through ahandshake process. After an initial handshake process is complete as isdescribed further below, data exchange occurs. In connection-orienteddata transfer, embodiments of the invention utilize a data header withan acknowledgement flag set and connection type set to 01, for example.Data being exchanged may be fragmented or non-fragmented based on thesize of the data and the underlying packet size supported by thephysical medium.

Fragmented Data

When an application writes to a virtual port, the session layer adds asession layer header to the data and forwards it down the stack. In oneor more embodiments, the session layer header is 2 bytes wide. Hence, iffragmentation is needed at the transport layer, the first fragment isset to contain the CID from the session layer while the rest of thefragments may contain only application data. The session layer at thereceiving end forwards the first fragment that contains the sessionlayer header, but is unsure as to where to forward other fragments fromthe sequence as there is no CID information in subsequent headers. Also,if two or more applications on one device want to send data to onedevice, it is not possible without further information in general at thereceiving end to aggregate fragmented data because there is no way touniquely identify which application is sending what data fragment. Toresolve this issue, the transport layer copies session layer header toall the related fragments. As all the fragments will now contain CID,they can be uniquely identified at the receiving end.

The session layer header contains an acknowledgement flag that isutilized in the case of complete messages. As the session layer ensuresapplication-to-application delivery of data, it sets the acknowledgementflag for the receiver to acknowledge successful delivery of data. As theheader is copied in each fragment, the session layer will look at theflag and will acknowledge the transmitter every time a fragment isdelivered which is not what acknowledgements are generally for, i.e., acomplete message acknowledgement.

To avoid this issue, the transport upper layer at the receiver endappends metadata to packets as they are sent up the stack. Metadataalong with pointer to received data fragment is called a token andinstead of passing data, transport layer passes a token to sessionlayer. In the case of exceptions in behavior of the session layer,metadata provides guidelines for the session layer to follow. Forexample, the session layer will not send any acknowledgements for datafragments, and when the transport upper layer receives a fragment with a“last fragment” flag set, it updates the metadata so that session layerknows that it needs to send an acknowledgement to the transmitterregarding the receipt of a complete message.

Flow of Control

As the fragments move through the session layer, session layer extractsthe CID from the fragments, performs a lookup in the Communication IDtable based on CID and the sources logical address obtained from themetadata. The session layer determines the associated file descriptorsource and destination ports for the CID. Once the file descriptor isknown, it removes all the headers and modifies the metadata tocommunicate the file descriptor detail to manager layer.

Once the fragment arrives at the manager layer, the manager layerextracts the file descriptor information from metadata and forwards thefragment to respective application. Before the manager layer forwardsthe message to the application, it determines if the file descriptor isstill in use and in the state of accepting data. If conditions arefavorable, the message is copied into the application buffer and a“message received” flag in file descriptor is set. If the currentoperation on the file descriptor is a blocking read, the read functioncall returns with number of bytes available in application buffer. Ifthe current operation is a non blocking call, the application eitherchecks the flag and if set, reads data from buffer, or the manager layermay make an asynchronous function call on receiving data.

After delivering the data to the application, the manager layer returnsthe token to session layer. This token contains information about thestate of the previously passed message. Depending on the state of token,the session layer performs activities such as sending asession-to-session layer acknowledgement.

If the data is fragmented, session layer further modifies this token andsends it down to transport layer, otherwise the session layer consumesthe token. The transport layer determines if the fragments weredelivered in sequence they were sent and accordingly controlsacknowledgements and window sizes.

Non-Fragmented Data

If a message size is less than the Maximum Transmission Unit (MTU), nofragmentation is required and the complete message is sent in one frame.As the frame moves up the stack, transport upper layer adds very littleinformation to the metadata as complete information for the sessionlayer is already available in the frames header. The session layer readsthe header and extracts the data type. If the data type isconnection-oriented data, the session layer extracts the CID andperforms a lookup in the CID table to determine source and destinationports. The session layer removes all the headers from the datagram,updates the metadata with the destination file descriptor, and forwardsit to the manager layer.

Connectionless Data Transfer

As mentioned above, in a connectionless data transfer, the session layermay be implemented in a lightweight or very thin layer. Asconnectionless data transfer does not utilize a handshake, no CID isgenerated. Due to the absence of the CID, the protocol header utilizessource and destination port addresses. The session layer reads thedestination port address and determines the associated file descriptorand forwards the message to that port. As connectionless datatransmission does not guarantee delivery of data, the acknowledgementflag on the frames is set to false.

If a connectionless data frame is larger than the MTU, the transportupper layer fragments the data into manageable sizes without setting thetransport layer acknowledgement flag as would be done in connectionbased communications. During reassembly, if transport layer sees anymissing fragments, it discards the complete message. Through a token,the transport layer informs upper layers to discard previouslyaccumulated fragments in application buffer.

Manager Layer

Manager layer handles file descriptors and forwards packets from lowerlayers to appropriate file handlers. The manager layer also performs thecopying of data from the memory pool into the application buffer. Themanager layer knows the size of the application buffer and theapplication buffer size may be smaller than one frame length.

If the application buffer is large enough, the manager layer copies thecomplete message into application buffer. If the application buffer isnot large enough, the manager layer copies data in a sequential manner.The manager layer fills the application buffer with data and waits forthe application to read the data before copying the next portion ofdata. Once data is successfully delivered to the application, dependingon the token, the manager layer informs the session layer regardingsuccess.

Control Flow Up the Stack

The flow of control is now described as data moves up the stack from thelowest layer to the application layer.

Data Link Layer

The data link layer control is described with respect to the twosub-layers that make up the data link layer, namely the link layer andthe MAC layer. The MAC layer controls the physical bus drivers.

MAC Layer

As the datagram arrives on the physical bus, the bus driver copies thedatagram into a buffer. Once the complete datagram is available in thebuffer, the MAC layer calls an API in Link Layer to copy the availabledata into the memory pool.

The link layer API returns a value to indicate the outcome of the copyoperation. The operation may succeed or fail. The returned error codeprovides the reason for any failure. The MAC layer waits for the API tofinish the operation before storing newly available data into thebuffer.

Link Layer

As discussed in the sections above, the memory pool may be fragmenteddue to applications consuming data at random rates, resulting in holesin the memory pool. In one or more embodiments, the link layer maintainsa link list, or a doubly link list, or bit map or any other datastructure capable of storing available memory locations in the memorypool. When a memory location is made available, a pointer to the memorylocation is added to the tail of the list. When a new datagram isavailable, it gets copied at the memory pointed by pointer in the headof the list. Though the received message can be of any size and whereina maximum size exists, for example 256 bytes, the size of the memorypool is selected to be an integral multiple of the maximum datagramsize. This simplifies memory management, as the stack is aware of thesize of allocated memory given the pointer to that memory. There may beinstances when a datagram is available at the time when memory is madeavailable in the memory pool. In this case, both the copy and the deleteprocesses will try to access the list simultaneously leading toconcurrency issues. In one or more embodiments, the memory pool mayinclude non-uniform size buffers for a more flexible bufferimplementation at the cost of memory management complexity as oneskilled in the art will recognize.

When the MAC layer calls an API to copy the data from hardware buffer tomemory pool, the API first checks the list for any available memorylocation in the pool. If memory is available, the API copies thedatagram to the memory location pointed by the head of the list anddeletes the pointer from the list. If no space is available, for examplethe link list is empty, or error occurs during the copying to memorypool, the API returns respective error code.

After successfully copying the datagram, the API adds the pointer to thedatagram in a list with a number of timer ticks remaining before thedata should be delivered to application. This API may be reentrant asthe MAC layer may be riding over multiple bus architectures and the datamay be available in multiple buffers at the same time resulting incalling this API while the layer is still servicing the previous call.

The protocol stack may be implemented with a time limit within which adatagram is to be used by an application, or else the datagram isdropped from the memory pool. To enable this feature, embodiments mayimplement a global list containing pointers to each datagram with thetimer count on each pointer. As the new packets arrive, an API adds thepointer to this packet at the end of this list. The API adds “time tolive” value to the current timer count and generates a timer count thatrepresents an expiration time for the packets. When timer count changes,an API looks at the timer count starting from top most element in thelist and starts deleting datagram if their timer counts are less than orequal to current timer count.

Once the data is consumed by the application or the data times out, anAPI is called to remove the datagram from the memory pool and add thepointer to the available memory list. This API may be reentrant as thedata may expire at the same time it was consumed by the application.Both processes may attempt to delete the same datagram, thereforesemaphores/locks may be utilized to effectively serialize control.

When data gets copied to memory pool, the link layer generates a tokenfor the packet. The token contains the pointer to the datagram andlength of the datagram. This token is forwarded to the transport layerthrough a transport layer API for further processing.

Transport Layer

After the transport lower layer receives a token, the transport lowerlayer determines if the frame is a transport-layer-to-transport layermessage. If the ‘layer flag’ is set, then these types of messages arelayer-to-layer messages and hence are not forwarded to upper layers. Ifthe flag is not set, transport lower layer looks at the priority of themessage and places the token into appropriate priority queue.

In one or more embodiments, the transport upper layer receives the tokenfrom the priority queue and determines if the ‘extended flag’ is set ornot. If the flag is set, it indicates that a large volume of data is tobe expected and informs the API that an extra byte has been used inheader for sequencing large number of fragments.

The layer also reads the “Last Fragment” flag. A set ‘last fragment’flag indicates to the layer that the current datagram fragment is thelast fragment in the sequence of fragments and hence the end of onemessage. If there is any fragmentation, at least one fragment will havethis flag set.

The layer further reads the acknowledgement flag. If the transmitterrequests or otherwise is to be sent an acknowledgement for delivery ofthe datagram to the receiver's transport layer, the layer will set thisflag and the receiver will acknowledge the receipt of the packet. If thedevices engaged in communication have agreed on a window size foracknowledgements, then the transport layer acknowledges after receivingwindow size messages else the layer acknowledges each datagram.

The transport upper layer adds more information to the data token andforwards it to session layer. The transport upper layer informs thesession layer if the message is a complete message or not. In case offragmented message, the transport layer informs the session layer aboutreceiving the last fragment, so that session layer may send anacknowledgement if needed.

Session Layer

From the data pointer in the token, the session layer accesses the frameand extracts session layer header. From the header, session layer firstdetermines if the message is a layer-to-layer message or needs to beforwarded up the stack. If the message is a layer-to-layer type message,then the message is consumed by session layer.

If the layer flag is not set, the frame is forwarded up the stack. Thesession layer reads the ‘Connection Type’ field and determines if themessage is of unknown connection type or connection-oriented orconnectionless. An unknown connection type is generally for the messagesexchanged during handshake process, whereas a connectionless messagedoes not need an acknowledgement for delivery, and connection-orientedmessages are the ones that use an acknowledgement on successfullydelivery.

The session layer further looks into the message type field to determinethe type of frame. The frame type is used to determine the purpose ofthe frame, and only ‘Data’ type frames are forwarded up the stack andthe control type frames are consumed at session layer.

The CID is generated by the application providing a service. Anyapplication that wants to use the service will request a communicationID. CID is unique within one module, for example all of the CID'sgenerated by the UIC are unique within a particular UIC. The CID isgenerated through a handshake process, where the application using theservice sends the details required for uniquely identifying an activeconnection and receives the CID in response.

The CID specifics and details may be stored in a CID table located in ashared memory region in one or more embodiments, so that the sessionlayers of all the applications may access the CID. In a connectionlessdata frame, there is no CID information as there is no handshakeutilized to establish a connection. Hence connectionless frames containboth source and destination port address in the header.

In a connection-oriented data transfer, there exists a CID in thesession layer header. Once the session layer determines the CID from theheader, the layer combines the information with the source logicaladdress available in the data token to uniquely identify an entry in CIDtable. From this table, the session layer determines the source anddestination port address and the file descriptors handling the port. Thesource logical address of the received frame is set by the data linklayer along with the file handler information and is forwarded in thedata token to the manager layer.

If the received frame is connection-oriented and is a complete message,the session layer maintains a record of the message and forwards thedata token to the manager layer. Once the manager layer copies the framefrom memory pool into the application buffer, the manager layer notifiesthe session layer about the successful delivery of data. On receipt ofnotification, the session layer sends an acknowledgement to thetransmitter session layer regarding the successful delivery of data. Ifthe delivery was unsuccessful, as a part of the acknowledgement, thesession layer forwards the error message returned from the manager layerto the transmitter.

Manager Layer

The session layer calls an API in manager layer and passes the datatoken to the manager layer. The manager layer copies the data frommemory pool into the application buffer and notifies the session layerregarding the copy. The manager layer notifies the lower layer about thedelivery of message by modifying the data token and sending the datatoken back to the session layer. Once the data is successfully copied,the manager layer removes the frame pointer from the list of framesmonitored by the timer and deletes the frame from the memory pool tomake room for new packets.

It may happen that the application buffer is smaller in size than thereceived data frame, in such cases the manager layer will fill theapplication buffer with what it can hold and wait for the application toconsume it. Once the application consumes the message, the remainingportion of the message is copied and the process is repeated until thecomplete frame is consumed. Before starting the progress of copyingmessages in small sizes, the manager layer removes the pointer to theframe from the timer-monitored list because the timer may expire andcorrupt the message. Also, the manager layer notifies the lower layerregarding successful delivery of data only when a complete message issent to the application. At the end of the sequential copy process, themanager layer deletes the frame from the memory pool.

In the case of fragmented data, as the fragments are received by thislayer, it copies the fragments into the application buffer and notifiesthe session layer. The session layer forwards the notification to thetransport layer. The transport layer, after receiving notifications fora window size number of messages, sends an acknowledgement to thetransmitter about receiving the messages. When the last fragment issuccessfully delivered to the application, it implies that one completemessage was delivered. In such cases, the manager layer notifies thesession layer of success, and the session layer sends an acknowledgementmessage to the transmitter regarding the success, thus providingguaranteed delivery of data.

Data Flow Down the Stack

Assuming that in case of a connection-oriented data transfer, thehandshake process has already been done and a valid CID has been alreadygenerated, the application copies data into an application buffer andpasses a pointer to the API exposed by the manager layer for sendingdata over virtual ports. The application also specifies the filedescriptor that handles the communication and the size of data to bewritten on the virtual port.

The priority of a message is determined by the priority of the virtualport being used or priority can be set for the message passing through.Hence, through a set of API's, the manager layer informs the sessionlayer about the priority of data, size of data, file descriptor for thecommunication, pointer to application buffer, and if data isconnection-oriented or connectionless. If the data is connectionless,the session layer looks into the file descriptor table and determinesthe port number associated with the file descriptor. The session layerthen adds source and destination port addresses as header to the data.If the transfer is to be connection-oriented, the session layer performsa lookup in the CID table and determines CID associated with the filedescriptor and adds this CID as header to the data. The session layerthen forwards this pointer to the transport layer and waits for anacknowledgement from the receiver.

The transport upper layer determines the size of the data and determinesif fragmentation is required or not. If fragmentation is needed, thetransport upper layer breaks the data into manageable sizes and addsinformation to the header so that the data can be reassembled at thereceiver's transport upper layer. If fragmentation is not needed, thetransport upper layer still adds some information in one or moreembodiments. For example, the transport upper layer copies the data fromapplication buffer into transmitter memory pool and depending on thepriority of data, stores the pointer into appropriate message queues.

The transport lower layer eventually reads the pointer from the priorityqueue and forwards it to the link layer. The link layer determines thedestination logical address and adds it to the data header, computes aCRC on the frame and adds it to the frame before sending it. The MAClayer determines the bus over which the destination is available andsends the data over that bus.

Flow of Data Up the Stack

As the data frame arrives at the underlying bus, the MAC layerdetermines if the frame is for the subsystem or for some othersubsystem. If it is for some other subsystem, the MAC layer drops thedata frame. The MAC layer copies valid data frames into a shared memoryregion and calls an API in the Link layer to inform it about arrival ofnew data. Throughout the stack, only the pointer to this data is updatedto reduce multiple copying of fragments.

The link layer computes the CRC on the received frame and compares thecomputed CRC with the CRC on the received frame. Frames with invalidCRC's are dropped. Pointers to valid frames are forwarded to thetransport lower layer.

The transport lower layer reads the priority of the frame and adds apointer to the frame to the respective priority queue. The pointer tothe frame remains in the queue and waits for appropriate application toconsume it. Eventually, the target application's transport upper layerreads the pointer to the frame from the priority queue.

The transport upper layer looks at the headers to determine if the datais fragmented or a complete message. If the data is fragmented, thelayer reassembles all the messages from the sequence and then forwardsit to the application layer. If the data is not fragmented, it directlyforwards the pointer to the frame to the session layer throughappropriate API calls.

The session layer looks at the frame headers and determines if themessage is of type connectionless or connection-oriented. If the messageis connectionless, the session layer looks at the destination portnumber and determines the file descriptor handling that port. Thesession layer forwards the pointer to the manager layer with appropriatefile descriptor information. If the frame is connection-oriented, thesession layer reads the CID and determines the file handler handlingthat communication. The session layer then forwards the file descriptorinformation to the manager layer and waits for an acknowledgement fromthe manager layer. The manager layer sends an acknowledgement indicatingwhether the data was delivered to the application or not. Thisinformation is used by the session layer to acknowledge receipt of data.

The manager layer may be implemented with a lightweight or thin layerand is responsible for copying the data from the memory pool into theapplication buffer and freeing the memory pool. Once the data getscopied into the application memory, the manager layer informs theapplication about data being available. The manager layer sends anacknowledgement to the session layer. Thus, to the applications, themanager layer offers synchronous and asynchronous methods for readingand writing to virtual ports.

FIG. 9 illustrates an activity diagram showing routing between variousdevices. As shown, Device A is connected directly to Device B, which isdirectly connected to Device C. Device A is not directly connect toDevice C. When Device A attempts to send a message to Device C, it sendsthe message out and Device B reads the message, determines that themessage is not for the device and checks to see if there is a path tothe device in Device B's destination table. If so, Device B forwards themessage to Device C, which processes the data. Hence, embodiments of theinvention enable routing and daisy chain or multi-bus configurationsthat are generally not as flexibly possible in medical devices such asinfusion pumps.

An embodiment of the manager layer API is detailed below. The managerlayer provides the API to enable socket programming over the protocolstack. The manager layer API calls are utilized by any application thatwishes to transfer data using an embodiment of the invention.

pro_socket—creates an unbound socket in a communication domain, andreturns a file descriptor that can be used in later function calls thatoperate on sockets.

int16 pro_socket (ConnectionType type, uint8*pSocket)

Arguments:

type: specifies the type of socket to be created (CONNECTIONTYPE andCONNECTIONLESSTYPE for connection oriented and connection-less dataexchange).

pSocket: integer pointer to return newly created socket.

typedef enum ConnType

{ CONNECTIONTYPE=1, CONNECTIONLESSTYPE=2, RAWTYPE=3 } ConnectionType;

On successful completion, the function shall return a SUCCESS; elseappropriate error code is returned. The API returns allocated socket inthe reference variable pSocket passed as a parameter.

pro_bind—assigns a local address to a socket identified by filedescriptor socket.

int16 pro_bind (uint8 uint8Socket, const ProSockaddr*pAddress)

typedef struct pro_sockaddr { uint8 address; uint8 portNo; uint8priority; uint8 flags; uint32 timeout; datafilter *filter; }ProSockaddr;

address: holds logical address of device

portNo: holds port number for connection

priority: holds the priority of the port. All the data passing throughthis port inherits ports priority

flags: holds configuration flags for changing behavior of socket

TIMEOUT: flag is set, waits for an operation to complete within a givenperiod of time, else returns.

SO_LINGER: set flag indicates that a connection will be terminated onlywhen all the data pending to be sent is sent successfully.

FILTER_DATA: set flag indicates that the data matching supplied filterpattern will only be forwarded to callback function registered to handleit. If flag is reset, data matching the filter will be sent to both,regular socket handler as well as to the registered callback function.

timeout: If the TIMEOUT flag is set, timeout value is specified here. Atimeout value of 0 returns immediately.

filter: link list of datafilter type structure defining the filter to beapplied on received data. More than one element in this link list willhave an ORing property. As an example, if an application wants toprocess data either from PMC, or UIC, or CE or all three, it will createthree nodes in this link list one for each PMC, UIC and CE.

Datafilter structure is used to allow applications to select whatmessages they want to receive, and which function should handle whattype of messages. A regular expression pattern is used to create afilter on received data and once a match is found, data is forwarded toregistered callback function.

typedef struct { char *regEx; uint8 index; uint8 length; void *callback;datafilter *filter; }datafilter;

regEx: pointer to regular expression to be used for matching.

index: location to start looking for match in the data section ofreceived message. A ‘0’ in this field indicates that the match willstart from the beginning.

length: staring from the provided index, indicates the length of datasection to be considered for regular expression matching. If indexcontains ‘0’ and length contains ‘0’, match will be performed over theentire data section.

callback: function to be called in case of a successful match. If thisfield is set to null, all the matching data packets will be droppeddepending on FILTER_DATA flag.

filter: linklist of any additional filter to be added over existingfilter. If this filed is contains additional filters, on a successfulmatch, callback is made to the function specified in the structurecontaining this linklist. This link list of filters has andingproperties, i.e. a match is successful only if all the regEx specifiedin all the filters match. As an example, if an application wants toprocess data containing expressions PMC, UIC and CE, it will instantiatethis filter for PMC and have a link list containing filters for UIC andCE respectively.

One or more embodiments support three priority levels for messagesnamely high, medium and low. The enum defining message priority is asfollows.

Typedef enum ProPriority { HIGHPRIORITYTYPE = 1, MEDIUMPRIORITYTYPE = 2,LOWPRIORITYTYPE = 3 } MessagePriority;Arguments:

uint8Socket: file descriptor of socket to be bound

pAddress: pointer to ProSockaddr struct containing address to be boundto the socket.

Return Value:

Upon successful completion, the function shall return SUCCESS, otherwiseappropriate error code.

pro_connect—attempts to connect a socket to the specified address.

int16 pro_connect (uint8 uint8Socket, const ProSockaddr *pAddress)

Arguments:

uint8Socket: socket to be connected to specified address.

pAddress: pointer to structure pro_sockaddr containing peer address.

Return Value:

Upon successful completion, the function shall return SUCCESS; otherwisereturns appropriate error code

pro_listen—marks the socket referred to by “socket” as a passive socket,that is, as a socket that will be used to accept incoming connectionrequests using accept( ).

int16 pro_listen (uint8 uint8Socket, uint8 uint8Backlog)

Arguments:

uint8Socket: file descriptor of a socket that needs to be put inaccepting connections mode.

uint8Backlog: set a limit on number of outstanding connections in thesocket's listen queue. A zero would set the queue length to systemdefined minimum queue length.

Return Value:

Upon successful completion, the function shall return SUCCESS;otherwise, appropriate error code is returned.

pro_accept—extracts the first connection on the queue of pendingconnections, creates a new connected socket with same socket typeprotocol and address family as the specified socket, and returns a newfile descriptor for the socket.

int16 pro_accept (uint8 uint8Socket, ProSockaddr *pAddress, uint8*pClientSocket)

Arguments:

uint8Socket: file descriptor associated with socket.

pAddress: Either a NULL pointer, or a pointer to ProSockaddr structwhere the address of connecting socket shall be returned.

pClientSocket: pointer to an unsigned integer for returning filedescriptor associated with the newly created socket.

Return Value:

Upon successful completion SUCCESS is returned along with an associatedfile descriptor for the newly created socket, on failure, returnsappropriate error code.

pro_send—initiates transmission of a message from the specified socketto its peer. The pro_send( )function sends a message when the socket isconnected.

int16 pro_send (uint8 uint8Socket, const void *pBuffer, uint32intLength, uint32 *pBytesSent)

Arguments:

uint8Socket: socket's file descriptor

pBuffer: points to buffer containing the message to send.

intLength: length of message in bytes.

pBytesSent: pointer to an integer for returning actual number of bytessent.

Return Value:

Upon successful completion, the API returns SUCCESS else appropriateerror code is returned.

pro_recv—receives a message from a connection-mode orconnectionless-mode socket. It is normally used with connected socketsbecause and does not provide the source address of received data to theapplication.

int16 pro_recv (uint8 uint8Socket, void *pBuffer, uint32 uintLength,uint32 *pBytesReceived)

Arguments:

uint8Socket: file descriptor of socket.

pBuffer: pointer to the buffer where message should be stored.

uintLength: length in bytes of the message to be received.

pBytesReceived: pointer to an integer for returning number of bytesactually received.

Return Value:

Upon successful completion, SUCCESS is returned along with number ofbytes in the reference passed as a parameter, else returns appropriateerror code.

pro_close—deallocates the file descriptor and makes the file descriptoravailable for functions which allocate file descriptors. All outstandingrecord locks owned by the process on the file associated with the filedescriptor are removed. Causes the socket to be destroyed. If the socketis in connection-oriented, and the SO_LINGER option is set for thesocket with non-zero linger time, and the socket has un-transmitteddata, then pro_close( ) blocks for up to the current linger interval forall pending data to be transmitted.

int16 pro_close (uint8 uint8Socket)

Arguments:

uint8Socket: file descriptor of socket that needs to be closed.

Return Value:

Upon successful completion, function shall return SUCCESS; otherwiseappropriate error code shall be returned.

One skilled in the art will recognize that in addition to the exemplaryAPI illustrated above for the Manager Layer, API's for the Session,Transport and Data Link Layers may be implemented as desired tocommunicate the messages shown in FIGS. 10A-D, 11A-B and 12A-B dependingon the desired application.

One or more embodiments of the invention may be implemented as a systemor method. For example at least one embodiment may include a medicaldevice communication method that includes accepting a request by aprogrammable device to obtain a device identifier associated with atransmitting device associated with the request, a connection type ofconnection-oriented or connectionless-oriented, and a receiving devicenumber associated with a receiving device to transmit a message to. Themethod may also include determining a port number of a port to transmitsaid message to, for example either via a requesting programmable deviceor the programmable device that receives the request. Embodiments mayalso include generating a communication identifier or CID for at leastthe advantages stated throughout this disclosure. Embodiments may alsoinclude accepting a request associated with a medical function,inserting the CID and the medical function into the message, determiningif the connection type is connection-oriented or connectionless andtransmitting the message to a medical device. This scenario is shownwith exemplary values to demonstrate the previous message formatting andtransfer in FIGS. 13A and 13B, which are intended to couple with oneanother on the right side of FIG. 13A and the left side of FIG. 13B.

Embodiments may also include transmitting the message to the receivingdevice even if the receiving device is not directly connected to thetransmitting device. This enables built in routing that allows fordevices to pass through messages without requiring a master to controlall phases of communication for example.

Embodiments may also include accepting a multicast request configured toenable multiple receiving devices to receive the message. Embodimentsmay further include accepting a priority parameter configured to enableprioritized handling of the message. This enables messages with highpriority to be delivered before other lower priority messages and in oneor more embodiments may be implemented with a plurality of message datastructures such as queues, linked lists or any other data structure orstructures. Embodiments may include transmitting messages from a highpriority message queue before transmitting data from a low prioritymessage queue. Other embodiments may apply any type of strategy patternto the delivery process, and may for example change strategies dependingon the type of messages that are likely to be received in particulartime periods. This enables predictive handling and processing ofmessages to provide intelligent and robust delivery of medicalfunctions.

Embodiments may also include determining if a size of data to transferis larger than a predetermined fragmentation value and packing the datain a plurality of messages to facilitate transfer. Embodiments mayefficiently utilize memory and for example reduce latency by copying apointer to the message between a plurality of message layers withoutcopying the message itself. This is the case since the message does nothave to be reconstructed in full within the stack until the full messageis received in the application. Furthermore, embodiments of theinvention may utilize optimized memory management that includesrequesting memory from a buffer that includes non-uniform sizes tofurther increase efficiency of data memory utilization and lower overallrequired memory. When sending data packets or message that are largerthan the maximum size allowed by the underlying hardware, embodimentsmay include setting a last fragmentation flag in a final message offragmented message, starting a timer for an acknowledgement andretransmitting the final message if said timer expires. Furtherincreases in efficiency may be achieved by embodiments that includereceiving a request to change a window size for receipt of fragmentedmessages and adjusting memory usage based thereon, for example havinglower window sizes for more reliable communication links. Embodimentsmay also include providing the device identifier to a new medical devicethat replaces the medical device after hot-swapping the new medicaldevice for the original medical device, i.e., if a failure occurs. Thisallows embodiments of the invention to provide robust functionality andtransparent replacement of hardware without interrupting medicalfunctions or at least minimizing the interruptions. Embodiments may alsoinclude providing a pointer to a complete message after receipt ofmultiple fragmented messages without copying received message data afterreceipt thereof. This enables incoming data to be inserted into a bufferonce and given to the application after the data is received withoutextraneous copying for example, which reduces memory utilization andprogrammable device processing required. One or more embodiments of theinvention may include accepting an infusion request associated with aninfusion related medical function. Any other type of medical function isin keeping with the spirit of the invention.

Embodiments of the system may include a programmable device configuredto accept a request to obtain a device identifier associated with atransmitting device associated with the request, a connection type ofconnection-oriented or connectionless-oriented, a receiving devicenumber associated with a receiving device to transmit a message to.Embodiments of the system may further determine a port number of a portto transmit said message to, generate a communication identifier or CIDand accept a request associated with a medical function. The system mayalso insert the CID and the medical function into the message, determineif the connection type is connection-oriented or connectionless andtransmit the message to a medical device. Embodiments of the system mayalso implement all functionality of the method previously described andmay utilize any of the data structures or API's described herein incombination.

While the invention herein disclosed has been described by means ofspecific embodiments and applications thereof, numerous modificationsand variations could be made thereto by those skilled in the art withoutdeparting from the scope of the invention set forth in the claims.

What is claimed is:
 1. A communication system for connecting a pumpmotor controller with a root controller, the communication systemcomprising: a pump motor controller configured to transmit a firstmessage to a root controller, the first message comprising a request foran address; a root controller configured to: receive the first message;determine in a stored table that there is no entry corresponding to thepump motor controller; generate a connection identifier for the pumpmotor controller based on the determination; associate the connectionidentifier in the stored table with the pump motor controller; andtransmit the connection identifier to the pump motor controller, whereinthe pump motor controller is further configured to update its identitywith the connection identifier.
 2. The communication system of claim 1,wherein the root controller is further configured to facilitatetransmission of a second message from the pump motor controller to anadditional hardware, wherein the pump motor controller and theadditional hardware are not directly connected.
 3. The communicationsystem of claim 2, wherein the second message is transferred between aplurality of message layers by copying a pointer and without copyingsaid second message itself.
 4. The communication system of claim 2,wherein a session layer communication is made independent of bustopology.
 5. The communication system of claim 1, wherein the rootcontroller is further configured to transmit the connection identifierto a second pump motor controller that replaces the pump motorcontroller.
 6. The communication system of claim 1, wherein a fragmentedmessage is reassembled into a complete message in an application buffer.7. The communication system of claim 1, wherein the root controller isfurther configured to: determine that a size of data to transfer islarger than a predetermined fragmentation value; and pack said data in aplurality of messages independent of an underlying data bus width. 8.The communication system of claim 1, wherein the root controller isfurther configured to request memory from a buffer comprisingnon-uniform sizes.
 9. The communication system of claim 1, wherein thepump motor controller is connected with the root controller withoutaltering an application of the pump motor controller.
 10. Thecommunication system of claim 1, wherein a root controller managesconnection requests from the plurality of pump motor controllers.
 11. Amethod for connecting hardware components of an infusion pump system,the method comprising: receiving a first message corresponding to afirst request for an address from a first pump motor controller;determining in a stored table that there is no entry corresponding tothe first pump motor controller; associating a first connectionidentifier for the first pump motor controller based on thedetermination; transmitting the first connection identifier to the firstmotor controller wherein the first pump motor controller is furtherconfigured to update its identity with the first connection identifier;receiving a second message corresponding to a second request for anaddress from a second pump motor controller; determining that the secondpump motor controller has replaced the first pump motor controller;changing the association of the first connection identifier from thefirst pump moto controller to the second motor controller; transmittingthe first connection identifier to the second motor controller, whereinthe second motor controller is further configured to update its identitywith the first connection identifier.
 12. The method of claim 11,further comprising facilitating transmission of a second message fromthe pump motor controller to an additional hardware, wherein the pumpmotor controller and the additional hardware are not directly connected.13. The method of claim 11, further comprising transmitting messagesbetween hardware components by copying a pointer and without copying themessages.
 14. The method of claim 11, wherein a session layercommunication is made independent of bus topology.
 15. The method ofclaim 11, wherein a fragmented message is reassembled into a completemessage in an application buffer.
 16. The method of claim 11, furthercomprising determining that a size of data to transfer is larger than apredetermined fragmentation value and packing said data in a pluralityof messages independent of an underlying data bus width.
 17. The methodof claim 11, further comprising requesting memory from a buffercomprising non-uniform sizes.